lib/Mi manual de algoritmos/version_maraton_suramericana_2008/manual.out

   1 \BOOKMARK [1][-]{section.1}{Teor\355a de n\372meros}{}
   2 \BOOKMARK [2][-]{subsection.1.1}{Big mod}{section.1}
   3 \BOOKMARK [2][-]{subsection.1.2}{Criba de Erat\363stenes}{section.1}
   4 \BOOKMARK [2][-]{subsection.1.3}{Divisores de un n\372mero}{section.1}
   5 \BOOKMARK [1][-]{section.2}{Combinatoria}{}
   6 \BOOKMARK [2][-]{subsection.2.1}{Cuadro resumen}{section.2}
   7 \BOOKMARK [2][-]{subsection.2.2}{Combinaciones, coeficientes binomiales, tri\341ngulo de Pascal}{section.2}
   8 \BOOKMARK [2][-]{subsection.2.3}{Permutaciones con elementos indistinguibles}{section.2}
   9 \BOOKMARK [2][-]{subsection.2.4}{Desordenes, desarreglos o permutaciones completas}{section.2}
  10 \BOOKMARK [1][-]{section.3}{Grafos}{}
  11 \BOOKMARK [2][-]{subsection.3.1}{Algoritmo de Dijkstra}{section.3}
  12 \BOOKMARK [2][-]{subsection.3.2}{Minimum spanning tree: Algoritmo de Prim}{section.3}
  13 \BOOKMARK [2][-]{subsection.3.3}{Minimum spanning tree: Algoritmo de Kruskal + Union-Find}{section.3}
  14 \BOOKMARK [2][-]{subsection.3.4}{Algoritmo de Floyd-Warshall}{section.3}
  15 \BOOKMARK [2][-]{subsection.3.5}{Algoritmo de Bellman-Ford}{section.3}
  16 \BOOKMARK [2][-]{subsection.3.6}{Puntos de articulaci\363n}{section.3}
  17 \BOOKMARK [2][-]{subsection.3.7}{M\341ximo flujo: M\351todo de Ford-Fulkerson, algoritmo de Edmonds-Karp}{section.3}
  18 \BOOKMARK [1][-]{section.4}{Programaci\363n din\341mica}{}
  19 \BOOKMARK [2][-]{subsection.4.1}{Longest common subsequence}{section.4}
  20 \BOOKMARK [2][-]{subsection.4.2}{Partici\363n de troncos}{section.4}
  21 \BOOKMARK [1][-]{section.5}{Geometr\355a}{}
  22 \BOOKMARK [2][-]{subsection.5.1}{\301rea de un pol\355gono}{section.5}
  23 \BOOKMARK [2][-]{subsection.5.2}{Centro de masa de un pol\355gono}{section.5}
  24 \BOOKMARK [2][-]{subsection.5.3}{Convex hull: Graham Scan}{section.5}
  25 \BOOKMARK [2][-]{subsection.5.4}{Convex hull: Andrew's monotone chain}{section.5}
  26 \BOOKMARK [2][-]{subsection.5.5}{M\355nima distancia entre un punto y un segmento}{section.5}
  27 \BOOKMARK [2][-]{subsection.5.6}{M\355nima distancia entre un punto y una recta}{section.5}
  28 \BOOKMARK [2][-]{subsection.5.7}{Determinar si un pol\355gono es convexo}{section.5}
  29 \BOOKMARK [2][-]{subsection.5.8}{Determinar si un punto est\341 dentro de un pol\355gono convexo}{section.5}
  30 \BOOKMARK [2][-]{subsection.5.9}{Determinar si un punto est\341 dentro de un pol\355gono cualquiera}{section.5}
  31 \BOOKMARK [1][-]{section.6}{Estructuras de datos}{}
  32 \BOOKMARK [2][-]{subsection.6.1}{\301rboles de Fenwick \363 Binary indexed trees}{section.6}
  33 \BOOKMARK [2][-]{subsection.6.2}{Segment tree}{section.6}
  34 \BOOKMARK [1][-]{section.7}{Miscel\341neo}{}
  35 \BOOKMARK [2][-]{subsection.7.1}{El parser m\341s r\341pido del mundo}{section.7}
  36 \BOOKMARK [1][-]{section.8}{Java}{}
  37 \BOOKMARK [2][-]{subsection.8.1}{Entrada desde entrada est\341ndar}{section.8}
  38 \BOOKMARK [2][-]{subsection.8.2}{Entrada desde archivo}{section.8}
  39 \BOOKMARK [2][-]{subsection.8.3}{Mapas y sets}{section.8}
  40 \BOOKMARK [2][-]{subsection.8.4}{Colas de prioridad}{section.8}
  41 \BOOKMARK [1][-]{section.9}{C++}{}
  42 \BOOKMARK [2][-]{subsection.9.1}{Entrada desde archivo}{section.9}
  43 \BOOKMARK [2][-]{subsection.9.2}{Strings con caract\351res especiales}{section.9}